Informatics Publishing Limited

R. Balakrishna ¹, K. S. Rajesh ²

Affiliations
1 Dept of ISE, Rajarajeswari College of Engineering, Bangalore, IN
2 Dept of CSE, Rajarajeswari College of Engineering, Bangalore, IN

Abstract

In this paper, the mobile ad hoc networks are proposed the each node participating in the network acts both host&router must be willing to forward to packets for other nodes. The characteristics of MANETs such as: dynamic topology, node mobility, provides large number of degree of freedom and self-organizing capability. Due to the nature of MANETs, to design and development of secure routing is challenging task for researcher in an open and distributed communication environments. The proposed work on this paper is address the security issue, because MANETs are generally more vulnerable, we proposed a secure routing protocol for MANETs, are named ASRP (Authenticate Secure Routing Protocol) based on DSDV. The new protocol works on each mode corresponds to specific state of the node. This protocol is design to protect the network from malicious and selfish nodes. We are implementing Extended Public key Cryptography mechanism in ASRP in order to achieve security.

Keywords

MANETs, Security, Cryptography, ASRP, DSDV.

Full Text

   

R. Balakrishna ¹, K. S. Rajesh ²

Affiliations
1 Dept. of ISE, Rajarajeswari College of Engineering, Bangalore, IN
2 Dept. of CSE, Rajarajeswari College of Engineering, Bangalore, IN

Abstract

In this paper have analyzed the interruption concert of a multi-hop wireless network in which the routes between resource-objective pairs are fixed. It has developed a new queue grouping technique to handle the complex correlations of the service process resulting from the multi-hop nature of the flows and their mutual sharing of the wireless medium. A general set based interfering model is assumed that imposes constraints on links that can be served simultaneously at any given time. These interference constraints are used to obtain a fundamental lower bound on the interruption concert of any scheduling policy for the system. It presents a systematic methodology to derive such lower bounds. For a special wireless system, namely the clique, it design a policy that is sample path interruption is finest. For the cycle queue network, where the interruption finest policy is known, the expected interruption of the optimal policy numerically coincides with the lower bound. The lower bound analysis provides useful insights into the design and analysis of optimal or nearly optimal scheduling policies.

Keywords

Hop by Hop, Performance, clique, Interference, Multi Hop, Scheduling, AMRIS.

Full Text

   

R. Balakrishna ¹, U. Rajeswar Rao ², Geethanjali ², M. S. Bhagyashekar ³

Affiliations
1 Dept of CSE, Don Bosco Institute of Technology, Bangalore-74, IN
2 Dept of Mathematics and CS&T, Sri Krishna Devaraya University, Anantapur, Andhra Pradesh, IN
3 Don Bosco Institute of Technology, Bangalore-74, IN

Abstract

The advantage of Mobile Ad-hoc Networks (MANETs) is to form a wireless network in the absence of fixed infrastructure. Early stages of routing protocols of MANETs were, incapable of handling security issues but by the introduction of newer techniques like cryptographic techniques enabled them to handle the routing information securely. The present paper details the newly proposed SAODV and TAODV and further compares the same with the existing MANET routing protocols.

Keywords

Mobility, Ad-Hoc, Security, Routing, Cryptography, TAODV, SAODV Performance.

Full Text

   

R. Balakrishna ¹, U. Rajeswara Rao ², G. A. Ramachandra ²

Affiliations
1 Dept of CSE, Don Bosco Institute of Technology, Bangalore, IN
2 Dept of Mathematics and CS&T, Sri Krishna Devaraya University, Anantapur, Andhra Pradesh, IN

Abstract

The broadcast operation, as a fundamental service in mobile adhoc networks (MANETs), is prone to the broadcast storm problem if forwarding nodes are not carefully designated. The objective of reducing broadcast redundancy while providing high delivery ratio under high transmission error rate is a major challenge in MANETs. This paper proposes a simple broadcast algorithm, called enhanced double-covered broadcast (EDCB), which takes advantage of broadcast redundancy to improve the delivery ratio in an environment that has rather high transmission error rate.

Keywords

Reliability, Enhanced Double Coverage, MANETS, Performance Evaluation, Forwarding Node.

Full Text